Fibonacci Primitive Roots
ثبت نشده
چکیده
(1) g 2 = g + 1 (mod p). It i s obvious that if (1) holds then so do (2) g 3 = g 2 + g (mod p) , (3) g 4 = g 3 + g 2 (mod p) , e t c .
منابع مشابه
Fibonacci Primitive Roots and the Period of the Fibonacci Numbers Modulop
One says g is a Fibonacci primitive root modulo /?, wherep is a prime, iff g is a primitive root modulo/7 and g = g + 1 (mod p). In [1 ] , [2 ] , and [3] some interesting properties of Fibonacci primitive roots were developed. In this paper, we shall show that a necessary and sufficient condition for a prime/? ^ 5 to have a Fibonacci primitive root is p = 1 or 9 (mod 10) and Alp) = p 1, where/I...
متن کاملConditions for the Existence of Generalized Fibonacci Primitive Roots
Consider sequences of integers {Un}TM=0 defined by U„ = aUn_x +bUn_2 for all integers n > 2, where U0 = 0, C/j = 1, a and b are given integers. We call these sequences generalized Fibonacci sequences with parameters a and b. In the case where a = b = 1, the sequence {Un}TM=0 is called the Fibonacci sequence, and we denote its terms by F0,Fl9.... The polynomial f(x) = x-ax-h with discriminant D ...
متن کاملLucas Primitive Roots
is called the characteristic polynomial of the sequence U. In the case where P = -g = 1, the sequence U is the Fibonacci sequence and we denote its terms by F0, Fl9 F2, ... . Let p be an odd prime with p\Q and let e > 1 be an integer. The positive integer u = u(p) is called the rank of apparition of p in the sequence U if p\Uu and p\Um for 0 < m < u; furthermore, u = u(p) is called the period o...
متن کاملG. Sburlati GENERALIZED FIBONACCI SEQUENCES AND LINEAR RECURRENCES
We analyze the existing relations among particular classes of generalized Fibonacci sequences, with characteristic polynomial having two integer roots. Several examples are given. Some properties concerning in general linear recurrences are also shown.
متن کاملGeneralized Fibonacci Sequences modulo Powers of a Prime
Let us begin by defining a generalized Fibonacci sequence (gn) with all gn in some abelian group as a sequence that satisfies the recurrence gn = gn−1 + gn−2 as n ranges over Z. The Fibonacci sequence (Fn) is the generalized Fibonacci sequence with integer values defined by F0 = 0 and F1 = 1. Recall also the Binet formula: for any integer n, Fn = (α − β)/ √ 5, where α = (1 + √ 5)/2 and β = (1− ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010